Multivariable public-key cryptosystems

نویسندگان

  • Jintai Ding
  • Dieter Schmidt
چکیده

Recently Landau and Diffie gave in a series of articles in the Notices of the American Mathematical Society [DL02, Lan01, Lan00a, Lan00b] and in the American Mathematical Monthly [Lan04] excellent expositions on how the theory of multivariable polynomials are used in cryptography. However they covered only half of the story. They covered only the theory of polynomials in symmetric or secret cryptography. There is another half of the story, namely the story about the theory of multivariable polynomials in asymmetric or public key cryptosystems. The importance of the theory of multivariable cryptosystems is manifested in the recent selection of Sflash by the Information Society Technologies (IST) Programme of the European Commission for the New European Schemes for Signatures, Integrity, and Encryption project (NESSIE) [NES] as one of the security standards for low-cost smart card. Sflash belongs to one of the families of public key cryptosystems, which have been developed in the last ten years.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

QTRU: quaternionic version of the NTRU public-key cryptosystems

In this paper we will construct a lattice-based public-key cryptosystem using non-commutative quaternion algebra, and since its lattice does not fully fit within Circular and Convolutional Modular Lattice (CCML), we prove it is arguably more secure than the existing lattice-based cryptosystems such as NTRU. As in NTRU, the proposed public-key cryptosystem relies for its inherent securi...

متن کامل

Comparison of two Public Key Cryptosystems

Since the time public-key cryptography was introduced by Diffie andHellman in 1976, numerous public-key algorithms have been proposed. Some of thesealgorithms are insecure and the others that seem secure, many are impractical, eitherthey have too large keys or the cipher text they produce is much longer than theplaintext. This paper focuses on efficient implementation and analysis of two mostpo...

متن کامل

Efficient elliptic curve cryptosystems

Elliptic curve cryptosystems (ECC) are new generations of public key cryptosystems that have a smaller key size for the same level of security. The exponentiation on elliptic curve is the most important operation in ECC, so when the ECC is put into practice, the major problem is how to enhance the speed of the exponentiation. It is thus of great interest to develop algorithms for exponentiation...

متن کامل

Cryptanalysis of an implementation scheme of the Tamed Transformation Method cryptosystem

A Tamed Transformation Method (TTM) cryptosystem was proposed by T.T.Moh in 1999. We describe how the rst implementation scheme of the TTM system can be defeated. The computational complexity of our attack is 2 33 computations on the nite eld with 2 8 elements. 1. Introduction During the last twenty years, public key cryptosystems have been developed to become an important part of our modern co...

متن کامل

Knapsack Public Key Cryptosystems And

This paper presents and analyzes cryptanalytic attacks on knapsack public key cryptosystems that are based on ideas from Diophantine approximation. Shamir’s attack on the basic Merkle-Hellman knapsack cryptosystem is shown to depend on the existence of ‘‘unusually good’’ simultaneous Diophantine approximations to a vector constructed from the public key. This aspect of Shamir’s attack carries o...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • IACR Cryptology ePrint Archive

دوره 2004  شماره 

صفحات  -

تاریخ انتشار 2004